Tool Presentation: Isabelle/HOL for Reachability Analysis of Continuous Systems
نویسنده
چکیده
We present a tool for reachability analysis of continuous systems based on affine arithmetic and Runge-Kutta methods. The distinctive feature of our tool is its verification in the interactive theorem prover Isabelle/HOL: the algorithm is guaranteed to compute safe overapproximations, taking into account all round-off and discretization errors.
منابع مشابه
Verified Reachability Analysis of Continuous Systems
Ordinary differential equations (ODEs) are often used to model the dynamics of (often safety-critical) continuous systems. This work presents the formal verification of an algorithm for reachability analysis in continuous systems. The algorithm features adaptive RungeKutta methods and rigorous numerics based on affine arithmetic. It is proved to be sound with respect to the existing formalizati...
متن کاملARCH-COMP17 Category Report: Continuous Systems with Nonlinear Dynamics
We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2017. This year, three tools CORA, Flow* and Isabelle/HOL (in alphabetic order) participated. They are applied to solve the reacha...
متن کاملEPiC Series in Computing
We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2017. This year, three tools CORA, Flow* and Isabelle/HOL (in alphabetic order) participated. They are applied to solve the reacha...
متن کاملFormalization of Dynamic Pushdown Networks in Isabelle/HOL
We present a formalization of Dynamic Pushdown Networks (DPNs) and the automata based algorithm for computing backward reachability sets using Isabelle/HOL. Dynamic pushdown networks are an abstract model for multithreaded, interprocedural programs with dynamic thread creation that was presented by Bouajjani, Mller-Olm and Touili in 2005. We formalize the notion of a DPN in Isabelle and describ...
متن کاملReachability Analysis with State-Compatible Automata
Regular tree languages are a popular device for reachability analysis over term rewrite systems, with many applications like analysis of cryptographic protocols, or confluence and termination analysis. At the heart of this approach lies tree automata completion, first introduced by Genet for left-linear rewrite systems. Korp and Middeldorp introduced so-called quasi-deterministic automata to ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015